Description: Many interesting route planning problems can be solved by computing shortest paths
in a suitably modeled, weighted graph representing a transportation network. Such networks
are naturally road networks or timetable networks of public transportation. For
large networks, the classical Dijkstra algorithm to compute shortest paths is too slow.
And therefore have faster algorithms been developed in recent years. These new algorithms
have in common that they use precomputation and store auxiliary data to speedup
subsequent shortest-path queries. Platform: |
Size: 11264 |
Author:manolin |
Hits:
Description: 这是我在几年前用Visual C++ 2003.net完成的机器人仿真项目，实现了：栅格环境的自定义生成、搜索，机器人的生成、路径行走和路径跟踪，障碍物的随机生成，动态规划法在路径跟踪中的应用，直线相交等图形学运算，OpenGL的应用，环境的保存和打开。-This is a project developed in Visual C++.net 2003 several years ago. In this project, it implemented: customedly generating and search grid environment, generating the robot and path-tracking, randomly generating barriers, using dynamic planning in path-tracking, line-intersecting and other computer-graphics algorithms, applying OpenGL, saving and opening the settings. Platform: |
Size: 6893568 |
Author:lmjlmj |
Hits:
Description: 该文件包含了一个能够实现简单路径规划的算法，有兴趣的可以下载下来以供参考学习-This file contains a simple path to achieve planning algorithms are interested can download it for reference study Platform: |
Size: 61440 |
Author:ljw |
Hits:
Search - Algorithms Path Planning